A Polynomial Time Algorithm for Edge Coloring Problem
نویسندگان
چکیده
منابع مشابه
A new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملA linear time algorithm for edge coloring of binomial trees
We consider the problem of efficient coloring of the edges of a so-called binomial tree T, i.e. acyclic graph containing two kinds of edges: those which must have a single color and those which are to be colored with L consecutive colors, where L is an arbitrary integer greater than 1. We give an O(n) time algorithm for optimal coloring of such a tree, where n is the number of vertices of T. Al...
متن کاملa new simulated annealing algorithm for the robust coloring problem
the robust coloring problem (rcp) is a generalization of the well-known graph coloring problem where we seek for a solution that remains valid when extra edges are added. the rcp is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. this problem has been proved as np-hard and in instances larger than 30 vertices, meta-...
متن کاملEnumeration Algorithm for the Edge Coloring Problem on Bipartite Graphs
In this paper, we propose an algorithm for nding all the edge colorings in bipartite graphs. Our algorithm requires O(T (n;m; ) + Kminfn 2 +m; T (n;m; )g) time and O(m ) space, where n denotes the number of vertices, m denotes the number of edges, denotes the number of maximum degree, T (n;m; ) denotes the time complexity of an edge coloring algorithm, and K denotes the number of edge colorings.
متن کاملAn Efficient Algorithm for the Nearly Equitable Edge Coloring Problem
An edge coloring of a multigraph is nearly equitable if, among the edges incident to each vertex, the numbers of edges colored with any two colors differ by at most two. It has been proved that the problem of finding a nearly equitable edge coloring can be solved in O(m/k) time, where m and k are the numbers of edges and given colors, respectively. In this paper, we present a recursive algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Society of Computer and Information
سال: 2013
ISSN: 1598-849X
DOI: 10.9708/jksci.2013.18.11.159